Compensated Horner Scheme
نویسندگان
چکیده
We present a compensated Horner scheme, that is an accurate and fast algorithm to evaluate univariate polynomials in floating point arithmetic. The accuracy of the computed result is similar to the one given by the Horner scheme computed in twice the working precision. This compensated Horner scheme runs at least as fast as existing implementations producing the same output accuracy. We also propose to compute in pure floating point arithmetic a valid error estimate that bound the actual accuracy of the compensated evaluation. Numerical experiments involving ill-conditioned polynomials illustrate these results. All algorithms are performed at a given working precision and are portable assuming the floating point arithmetic satisfies the IEEE-754 standard.
منابع مشابه
Compensated Horner algorithm in K times the working precision
We introduce an algorithm to evaluate a polynomial with oating point coe cients as accurately as the Horner scheme performed in K times the working precision, for K an arbitrary integer. The principle is to iterate the error-free transformation of the compensated Horner algorithm and to accurately sum the nal decomposition. We prove this accuracy property with an a priori error analysis. We ill...
متن کاملAlgorithmes compensés en arithmétique flottante : précision, validation, performances. (Compensated algorithms in floating point arithmetic : accuracy, validation, performances)
Rounding error may totally corrupt the result of a oating point computation.How to improve and validate the accuracy of a oating point computation, without largecomputing time overheads ? We contribute to this question considering two examples:polynomial evaluation and linear triangular system solving. In both cases we use thecompensation of the rounding errors to improve the ac...
متن کاملFaithful Polynomial Evaluation with Compensated Horner Algorithm
This paper presents two sufficient conditions to ensure a faithful evaluation of polynomial in IEEE-754 floating point arithmetic. Faithfulness means that the computed value is one of the two floating point neighbours of the exact result; it can be satisfied using a more accurate algorithm than the classic Horner scheme. One condition here provided is an a priori bound of the polynomial conditi...
متن کاملAccurate Polynomial Evaluation in Floating Point Arithmetic
One of the three main processes associated with polynomials is evaluation; the two other ones being interpolation and root finding. Higham [1, chap. 5] devotes an entire chapter to polynomials and more especially to polynomial evaluation. The small backward error the Horner scheme introduce when evaluated in floating point arithmetic justifies its practical interest. It is well known that the c...
متن کاملMore Instruction Level Parallelism Explains the Actual Efficiency of Compensated Algorithms
The compensated Horner algorithm and the Horner algorithm with double-double arithmetic improve the accuracy of polynomial evaluation in IEEE-754 floating point arithmetic. Both yield a polynomial evaluation as accurate as if it was computed with the classic Horner algorithm in twice the working precision. Both algorithms also share the same low-level computation of the floating point rounding ...
متن کامل